BÜCHI COMPLEMENTATION MADE TIGHTER
نویسندگان
چکیده
منابع مشابه
Büchi Complementation Made Tighter
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems is reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constru...
متن کاملBüchi Complementation Made Tight
The precise complexity of complementing Büchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple – it suffices to determinize them using a simple subset construction and to dualize the acceptance condition of the resulting automaton – Büchi complementation is more involved. Indeed, the construction of an EXPTIME complemen...
متن کاملBüchi Complementation
This entry provides a verified implementation of rank-based Büchi Complementation [1]. The verification is done in three steps: 1. Definition of odd rankings and proof that an automaton rejects a word iff there exists an odd ranking for it. 2. Definition of the complement automaton and proof that it accepts exactly those words for which there is an odd ranking. 3. Verified implementation of the...
متن کاملState of Büchi Complementation
Complementation of Büchi automata has been studied for over five decades since the formalism was introduced in 1960. Known complementation constructions can be classified into Ramsey-based, determinization-based, rank-based, and slice-based approaches. Regarding the performance of these approaches, there have been several complexity analyses but very few experimental results. What especially la...
متن کاملThe Büchi Complementation Saga
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2006
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054106004145